منابع مشابه
Estrada and L-Estrada Indices of Edge-Independent Random Graphs
Let G be a simple graph of order n with eigenvalues λ1, λ2, · · · , λn and normalized Laplacian eigenvalues μ1,μ2, · · · ,μn. The Estrada index and normalized Laplacian Estrada index are defined as EE(G) = ∑n k=1 e λk and LEE(G) = ∑n k=1 e μk−1, respectively. We establish upper and lower bounds to EE and LEE for edge-independent random graphs, containing the classical Erdös-Rényi graphs as spec...
متن کاملLaplacian Estrada and Normalized Laplacian Estrada Indices of Evolving Graphs
Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacia...
متن کاملCharacterization of graphs having extremal Randić indices
The higher Randić index Rt (G) of a simple graph G is defined as Rt (G) = ∑ i1i2···it+1 1 √ δi1δi2 · · · δit+1 , where δi denotes the degree of the vertex i and i1i2 · · · it+1 runs over all paths of length t in G. In [J.A. Rodríguez, A spectral approach to the Randić index, Linear Algebra Appl. 400 (2005) 339–344], the lower and upper bound on R1(G) was determined in terms of a kind of Laplaci...
متن کاملThe Estrada Index of Graphs
Let G be a simple n-vertex graph whose eigenvalues are λ1, . . . , λn. The Estrada index of G is defined as EE(G) = ∑n i=1 e λi . The importance of this topological index extends much further than just pure graph theory. For example, it has been used to quantify the degree of folding of proteins and to measure centrality of complex networks. The talk aims to give an introduction to the Estrada ...
متن کاملBounds of distance Estrada index of graphs
Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2020
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.10.029